Von Neumann’s expanding model on random graphs
نویسندگان
چکیده
منابع مشابه
Typical properties of optimal growth in the Von Neumann expanding model for large random economies
We calculate the optimal solutions of the fully heterogeneous Von Neumann expansion problem with N processes and P goods in the limit N → ∞. This model provides an elementary description of the growth of a production economy in the long run. The system turns from a contracting to an expanding phase as N increases beyond P. The solution is characterized by a universal behavior, independent of th...
متن کاملMajority Model on Random Regular Graphs
Consider a graph G = (V, E) and an initial random coloring where each vertex v ∈ V is blue with probability Pb and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to the most frequent color in their neighborhood and in case of a tie, a vertex keeps its current color. The main goal of the present paper is to analyze the behavior...
متن کاملMajority-vote model on random graphs.
The majority-vote model with noise on Erdös-Rényi's random graphs has been studied. Monte Carlo simulations were performed to characterize the order-disorder phase transition appearing in the system. We found that the value of the critical noise parameter qc is an increasing function of the mean connectivity z of the random graph. The critical exponents beta/nu, gamma/nu, and 1/nu were calculat...
متن کاملOn the Model Theory of Random Graphs
Title of dissertation: ON THE MODEL THEORY OF RANDOM GRAPHS Justin Brody, Doctor of Philosophy, 2009 Dissertation directed by: Professor Michael C. Laskowski Department of Mathematics Hrushovski’s amalgamation construction can be used to join a collection of finite graphs to produce a “generic” of this collection. The choice of the collection and the way they are joined are determined by a real...
متن کاملRandom Multi-Hopper Model. Super-Fast Random Walks on Graphs
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2007
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2007/05/p05012